Optimized Block-Based Algorithms to Label Connected Components on GPUs

A Study on Connected Components Labeling algorithms using GPUs

Connected Components Labeling (CCL) is a wellknown problem with many applications in Image Processing. We propose in this article an optimized version of CCL for GPUs using GPGPU (General-Purpose Computing on Graphics Processing Units) techniques and the usual UnionFind algorithm to solve the CCL problem. We compare its performance with an efficient serial algorithm and with Label Equivalence, ...

An Optimized Union-Find Algorithm for Connected Components Labeling Using GPUs

In this paper, we report on an optimized union-find (UF) algorithm that can label the connected components on a 2D image efficiently by employing GPU architecture. The proposed method comprises three phases: UF-based local merge, boundary analysis, and link. The coarse labeling in local merge, which makes computation efficient because the length of the labelequivalence list is sharply suppresse...

Connected components labeling - algorithms in

Parallel Algorithms for Connected Components

In this paper, we describe our implementation of several parallel graph algorithms for nding connected components. Our implementation, with virtual processing, is on a 16,384-processor MasPar MP-1 using the language MPL. We present extensive test data on our code. In our previous projects [21, 22, 23], we reported the implementation of an extensible parallel graph algorithms library. We develop...

Connected components algorithms for mesh-connected parallel computers

We present a new CREW PRAM algorithm for nding connected components. For a graphG with n vertices andm edges, algorithmA0 requires at mostO(logn) parallel steps and performsO((n+m) logn) work in the worst case. The advantage our algorithm has over others in the literature is that it can be adapted to a 2-D mesh-connected communication model in which all CREW operations are replaced byO(logn) pa...